Construction Of the Constrained Delaunay Triangulation Of A Polygonal Domain
نویسنده
چکیده
A fast and easy to implement divide-and-conquer algorithm is presented for the construction of the Constrained Delaunay triangulation of a polygonal domain. The algorithm simplifies the complicated merging step inherent to divide-and-conquer algorithms for the computation of triangulations. Furthermore, no triangles are computed outside the valid region of the domain. A grid structure accelerates the computation of the visibility among vertices with respect to the boundary polygons as well as the computation of Constrained Delaunay triangles.
منابع مشابه
Automatic Construction of Quality Nonobtuse Boundary And/or Interface Delaunay Triangulations the Control Volume Methods
In this paper we discuss a new algorithm that for any input quality constrained Delaunay triangulation with minimum interior angle greater than or equal to 30 , produces a quality nonobtuse boundary and/or interface Delaunay triangulation by the Delaunay insertion of a nite number of boundary and/or interface points. A boundary (interface) obtuse triangle is a triangle that has an obtuse angle ...
متن کاملFully Dynamic Constrained Delaunay Triangulations
We present algorithms for the efficient insertion and removal of constraints in Delaunay Triangulations. Constraints are considered to be points or any kind of polygonal lines. Degenerations such as edge overlapping, self-intersections or duplicated points are allowed and are automatically detected and fixed on line. As a result, a fully Dynamic Constrained Delaunay Triangulation is achieved, a...
متن کاملObject-oriented Hierarchical Image Vectorization
We present proximity graphs based approach to hierarchical image segmentation and vectorization. Our method produces an irregular pyramid that contains a stack of vectorized images of successively reduced levels of detail. We are jumping off from the over-segmented image represented by polygonal patches, which are attributed with spectral information. We employ constrained Delaunay triangulatio...
متن کاملGAP-Tree Extensions Based on Skeletons
The Generalized Area Partitioning tree (GAP-tree) is a model that supports onthe-fly generalisation of planar partitions of polygon objects. This paper focuses on solving some limitations of the existing GAP-tree and explores two extensions. The first extension enables the handling of a disjoint polygonal cluster (within the partition) and allows aggregation operations to be performed. The skel...
متن کاملOn recent advances in 2D Constrained Delaunay triangulation algorithms
In this article, recent works on 2D Constrained Delaunay triangulation(CDT) algorithms have been reported. Since the review of CDT algorithms presented by de Floriani(Issues on Machine Vision, Springer Vienna, pg. 95–104, 1989), different algorithms for construction and applications of CDT have appeared in literature each concerned with different aspects of computation and different suitabiliti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995